General approach for construction of deterministic compressive sensing matrices
نویسندگان
چکیده
منابع مشابه
Deterministic Sensing Matrices in Compressive Sensing: A Survey
Compressive sensing is a sampling method which provides a new approach to efficient signal compression and recovery by exploiting the fact that a sparse signal can be suitably reconstructed from very few measurements. One of the most concerns in compressive sensing is the construction of the sensing matrices. While random sensing matrices have been widely studied, only a few deterministic sensi...
متن کاملDeterministic Construction of Compressed Sensing Matrices using BCH Codes
In this paper we introduce deterministic m×n RIP fulfilling ±1 matrices of order k such that log m log k ≈ log(log2 n) log(log2 k) . The columns of these matrices are binary BCH code vectors that their zeros are replaced with −1 (excluding the normalization factor). The samples obtained by these matrices can be easily converted to the original sparse signal; more precisely, for the noiseless sa...
متن کاملDeterministic construction of sparse binary and ternary matrices from existing binary sensing matrices
In the present work, we discuss a procedure for constructing sparse binary and ternary matrices from existing two binary sensing matrices. The matrices that we construct have several attractive properties such as smaller density, which supports algorithms with low computational complexity. As an application of our method, we show that a CS matrix of general row size different from p, p, pq (for...
متن کاملCompressive Sensing and Structured Random Matrices
These notes give a mathematical introduction to compressive sensing focusing on recovery using `1-minimization and structured random matrices. An emphasis is put on techniques for proving probabilistic estimates for condition numbers of structured random matrices. Estimates of this type are key to providing conditions that ensure exact or approximate recovery of sparse vectors using `1-minimiza...
متن کاملDeterministic constructions of compressed sensing matrices
Compressed sensing is a new area of signal processing. Its goal is to minimize the number of samples that need to be taken from a signal for faithful reconstruction. The performance of compressed sensing on signal classes is directly related to Gelfand widths. Similar to the deeper constructions of optimal subspaces in Gelfand widths, most sampling algorithms are based on randomization. However...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Signal Processing
سال: 2019
ISSN: 1751-9675,1751-9683
DOI: 10.1049/iet-spr.2018.5238